#include <stdio.h>
int prime(int p ){
    if(p == 1) return 0;
    for(int i = 2; i < p; i++){
        if(p % i == 0) return 0;
    }
    return 1;
}
void Goldbach( int n ){
    for (int i = 2; i < n; i++)
    {
        if (prime(i) && i%2 && prime(n-i))
        {
            printf("%d=%d+%d", n, i, n-i);
            break;
        }
    }
}
int main(int argc, char const *argv[])
{
    int m, n, i, cnt;
    scanf("%d %d", &m, &n);
    if ( prime(m) != 0 ) printf("%d is a prime number\n", m);
    if ( m < 6 ) m = 6;
    if ( m%2 ) m++;
    cnt = 0;
    for( i=m; i<=n; i+=2 ) {
        Goldbach(i);
        cnt++;
        if ( cnt%5 ) printf(", ");
        else printf("\n");
    }

    return 0;
}
